Double VNS for the Molecular Distance Geometry Problem
نویسندگان
چکیده
In this paper we propose a VNS-based algorithm for the solution of the Molecular Distance Geometry Problem. First, we use VNS to solve a smoothed version of the problem to identify the most promising zone in the solution space. We then use VNS again to solve the original problem restricted to the promising zone. This algorithm often manages to find a solutions having higher accuracy than other methods. This is important as small differences in the objective function value may mean completely different 3D molecular structures.
منابع مشابه
Applying Permutation Distance in VNS for QAP
In this paper, a new concept distance called permutation distance is proposed and exploited in detail. We combine it with the hamming distance and propose a group of new neighborhood structures in VNS for QAP. Numerical tests running on the standard benchmark library QAPLIB show that this approach would dramatically improve the performance of VNS for QAP.
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملDouble variable neighbourhood search with smoothing for the molecular distance geometry problem
We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem, and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective fun...
متن کاملA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملFitness landscape analysis and design of metaheuristics for car sequencing
We study the car sequencing (CS) problem, an NPhard combinatorial optimization problem which aims at finding a production sequence of different models launched down a mixedmodel assembly line. The models are differentiated by a number of selected options. For each option, a so-called sequencing rule is applied which restricts the option occurrences in the sequence in order to minimize the work ...
متن کامل